Parallel Priority Queue and List Contraction: The BSP Approach
نویسندگان
چکیده
In this paper we present eecient and practical extensions of the randomized Parallel Priority Queue (PPQ) algorithms of Ranade et al., and eecient randomized and deterministic algorithms for the problem of list contraction on the Bulk-Synchronous Parallel (BSP) model. We also present an experimental study of their performance. We show that our algorithms are communication eecient and achieve small multiplicative constant factors for a wide range of parallel machines.
منابع مشابه
A new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
متن کاملRealistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model
In this paper, we explore parallel implementations of the abstract data type priority queue. We use the BSP* model, an extension of Valiant's BSP model which rewards blockwise communication, i.e. sending a few large messages instead of many small ones. We present two randomized approaches for diierent relations between the size of the data structure and the number of parallel updates to be perf...
متن کاملRealistic Parallel Algorithms : Priority Queue Operationsand Selection for the BSP * Model yArmin B
In this paper, we explore parallel implementations of the abstract data type priority queue. We use the BSP* model, an extension of Valiant's BSP model which rewards blockwise communication, i.e. sending a few large messages instead of many small ones. We present two randomized approaches for diierent relations between the size of the data structure and the number of parallel updates to be perf...
متن کاملRealistic Parallel Algorithms : Priority Queue Operationsand Selection
In this paper, we explore parallel implementations of the abstract data type priority queue. We use the BSP* model, an extension of Valiant's BSP model which rewards blockwise communication, i.e. sending a few large messages instead of many small ones. We present two randomized approaches for diierent relations between the size of the data structure and the number of parallel updates to be perf...
متن کاملThe design and analysis of bulk-synchronous parallel algorithms
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. This thesis presents a systematic approach to the design and analysis of BSP algorithms. We introduce an extension of the BSP model, called BSPRAM, which reconciles shared-memory style programming with e cient exploitation of data locality. The BSPRAM model can be optimally si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997